On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
نویسندگان
چکیده
منابع مشابه
On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
This paper deals with the problem of finding a base and strong generating set for the group generated by a given set of permutations. The concepts of base and strong generating set were introduced by Sims [5], [6] and provide the most effective tool for computing with permutation groups of high degree. One algorithm, originally proposed by Sims [7], is described in detail; its behavior on a num...
متن کاملGenerating Functions for Permutations which Contain a Given Descent Set
A large number of generating functions for permutation statistics can be obtained by applying homomorphisms to simple symmetric function identities. In particular, a large number of generating functions involving the number of descents of a permutation σ, des(σ), arise in this way. For any given finite set S of positive integers, we develop a method to produce similar generating functions for t...
متن کاملpassivity in waiting for godot and endgame: a psychoanalytic reading
this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...
Finding the Minimal Generating Set for a Finitely Generated Abelian Group on a Quantum Computer
In this paper we use basic concepts of Quantum Computing to try to solve the problem of finding generators of a finitely generated abelian group. We present three algorithms based on random selection of group elements to find a minimal generating set for a finite abelian group. We also describe an algorithm for finding a minimal generating set for a torsion free abelian group.
متن کاملThe IUFP Algorithm for Generating Simulation Heart
In all systems simulation, random variates are considered as a main factor and based of simulation heart. Actually, randomization is inducted by random variates in the simulation. Due to the importance of such a problem, a new method for generation of random variates from continuous distributions is presented in this paper. The proposed algorithm, called uniform fractional part (UFP) is simpler...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1980
ISSN: 0025-5718
DOI: 10.2307/2006206